全文获取类型
收费全文 | 740篇 |
免费 | 87篇 |
国内免费 | 16篇 |
专业分类
化学 | 166篇 |
力学 | 23篇 |
综合类 | 20篇 |
数学 | 393篇 |
物理学 | 241篇 |
出版年
2024年 | 3篇 |
2023年 | 12篇 |
2022年 | 21篇 |
2021年 | 49篇 |
2020年 | 24篇 |
2019年 | 26篇 |
2018年 | 25篇 |
2017年 | 32篇 |
2016年 | 48篇 |
2015年 | 29篇 |
2014年 | 41篇 |
2013年 | 62篇 |
2012年 | 47篇 |
2011年 | 42篇 |
2010年 | 25篇 |
2009年 | 43篇 |
2008年 | 37篇 |
2007年 | 43篇 |
2006年 | 39篇 |
2005年 | 28篇 |
2004年 | 19篇 |
2003年 | 23篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 15篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有843条查询结果,搜索用时 31 毫秒
71.
基于概念的教育资源元素材聚类方法研究 总被引:5,自引:0,他引:5
针对教育资源元素材种类多、独立性强等特点,研究了概念聚类方法解决领域知识的分类和归并问题,并实现了概念的动态聚类算法和归并算法,分析了该算法的效率和聚类准确性. 相似文献
72.
模糊聚类分析的新算法 总被引:1,自引:0,他引:1
张兴华 《数学的实践与认识》2005,35(3):138-141
提出了一种模糊聚类分析的新算法——追踪法 ,解决了以往模糊聚类分析计算量过大以及难于编程实现的问题 .该方法尤其适用于大规模数据的模糊聚类分析 ,对于模糊聚类分析的推广使用有重要意义 . 相似文献
73.
Éric D. Taillard 《Journal of Heuristics》2003,9(1):51-73
This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and the centres is minimized. The first method proposed is a candidate list search that produces good solutions in a short amount of time if the number of centres in the problem is not too large. The second method is a general local optimization approach that finds very good solutions. The third method is designed for problems with a large number of centres; it decomposes the problem into subproblems that are solved independently. Numerical results show that these methods are efficient—dozens of best solutions known to problem instances of the literature have been improved—and fast, handling problem instances with more than 85,000 entities and 15,000 centres—much larger than those solved in the literature. The expected complexity of these new procedures is discussed and shown to be comparable to that of an existing method which is known to be very fast. 相似文献
74.
75.
Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms 总被引:1,自引:0,他引:1
A. P. Reynolds G. Richards B. de la Iglesia V. J. Rayward-Smith 《Journal of Mathematical Modelling and Algorithms》2006,5(4):475-504
Previous research has resulted in a number of different algorithms for rule discovery. Two approaches discussed here, the ‘all-rules’ algorithm and multi-objective metaheuristics, both result in the production of a large number of partial classification rules, or ‘nuggets’, for describing different subsets of the records in the class of interest. This paper describes the application of a number of different clustering algorithms to these rules, in order to identify similar rules and to better understand the data. 相似文献
76.
A genetic k-medoids clustering algorithm 总被引:1,自引:0,他引:1
We propose a hybrid genetic algorithm for k-medoids clustering. A novel heuristic operator is designed and integrated with the genetic algorithm to fine-tune the search.
Further, variable length individuals that encode different number of medoids (clusters) are used for evolution with a modified
Davies-Bouldin index as a measure of the fitness of the corresponding partitionings. As a result the proposed algorithm can
efficiently evolve appropriate partitionings while making no a priori assumption about the number of clusters present in the datasets. In the experiments, we show the effectiveness of the proposed
algorithm and compare it with other related clustering methods. 相似文献
77.
中国股票市场波动特性的实证研究 总被引:4,自引:0,他引:4
倪杰 《数学的实践与认识》2003,33(9):50-54
本文以上证综指和深成分指数的日收益率为研究对象 ,应用 GARCH、TARCH模型理论 ,进一步分析了日收益率波动的条件异方差性、非对称性 ,同时比较了两个股票市场的不同波动特征 相似文献
78.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
79.
80.
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is an NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the eigenvalues of graph 1-Laplacian. In this paper, we first give new notations to describe the paths, among critical eigenvectors of the graph 1-Laplacian, realizing sets with prescribed genus. We introduce the pseudo-orthogonality to characterize m3(G), a special eigenvalue for the graph 1-Laplacian. Furthermore, we use it to give an upper bound for the third graph Cheeger constant h3(G), that is, h3(G) 6 m3(G). This is a first step for proving that the k-th Cheeger constant is the minimum of the 1-Laplacian Raylegh quotient among vectors that are pseudo-orthogonal to the vectors realizing the previous k - 1 Cheeger constants. Eventually, we apply these results to give a method and a numerical algorithm to compute m3(G), based on a generalized inverse power method. 相似文献